Candidate selection algorithms in opportunistic routing based on distance progress
نویسندگان
چکیده
منابع مشابه
Candidate selection algorithms in opportunistic routing based on distance progress
Opportunistic Routing (OR) is a new class of routing protocols that selects the next-hop forwarder on-the-fly. In contrast to traditionally routing, OR does not select a single node as the next-hop forwarder, but a set of forwarder candidates. When a packet is transmitted, the candidates coordinate such that the best one receiving the packet will forward it, while the others will discard the pa...
متن کاملModeling and comparison of candidate selection algorithms in opportunistic routing
Opportunistic Routing (OR) has been investigated in recent years as a way to increase the performance of multihop wireless networks by exploiting its broadcast nature. In contrast to traditional routing, where traffic is sent along pre-determined paths, in OR an ordered set of candidates is selected for each next-hop. Upon each transmission, the candidates coordinate such that the most priority...
متن کاملMobility-based Candidate Selection and Coordination in Opportunistic Routing for Mobile Ad-Hoc Networks
Opportunistic Routing (OR) is an effective and enhanced routing scheme for wireless multihop environment. OR is an approach that selects a certain number of best forwarders (candidates) at each hop by taking the advantage of the broadcast nature of the wireless medium to reach the destination. When a set of candidates receive the packet, they coordinate with each other to figure out which one h...
متن کاملEfficacy Analysis for On-Selection Candidate Nodes in Correlation Aware Opportunistic Routing
Opportunistic network is a type of challenged network where the nodes come across erratic contacts and whose performance is highly variable. In opportunistic network source and destination are in different range and one hop communication is carried out, when two nodes comes into the same range. Challenging factor in opportunistic network is tracing and routing. When routing protocol like epidem...
متن کاملEfficient Clustering Routing Algorithm Based on Opportunistic Routing
Based on the analysis of the existing classic clustering routing algorithm HEED, this paper proposes an efficient dynamic clustering routing algorithm ED-HEED. In the cluster selection process, in order to optimize the network topology and select more proper nodes as the cluster head, the proposed clustering algorithm considers the shortest path prediction of the node to the destination sink an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Ad Hoc and Ubiquitous Computing
سال: 2015
ISSN: 1743-8225,1743-8233
DOI: 10.1504/ijahuc.2015.073168